On the randomness that generates biased samples: The limited randomness approach

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Limited Randomness

7 A Sketch of a Research Immersion Lab/Master Thesis: Randomized Algorithms with Limited Randomness 7 7.1 Experimental Work: Quicksort . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 7 7.2 Experimental Work: Randomized Incremental Constructions . . . . . . . . . . . . . . . . 7 7.3 Theoretical Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

Computationally Limited Randomness

The starting point of this work is the basic question of whether there exists a formal and meaningful way to limit the computational power that a time bounded randomized Turing Machine can employ on its randomness. We attack this question using a fascinating connection between space and time bounded machines given by Cook [Coo71]: a Turing Machine S running in space s with access to an unbounde...

متن کامل

Biased rankings: The centrifugal and centripetal force of randomness

We study the ranking of entities, in terms of a metric which is averaged across the entities’ constituting units, such as countries (entities) being ranked in terms of the average height (metric) of their inhabitants (units). We show that when 1) the entities differ in terms of the number of units they contain (e.g. countries with different numbers of inhabitants), and when 2) part of the varia...

متن کامل

Functions That Preserve p-Randomness

We show that polynomial-time randomness (p-randomness) is preserved under a variety of familiar operations, including addition and multiplication by a nonzero polynomial-time computable real number. These results follow from a general theorem: If I ⊆ R is an open interval, f : I → R is a function, and r ∈ I is p-random, then f(r) is p-random provided 1. f is p-computable on the dyadic rational ...

متن کامل

Algorithms for Playing Games with Limited Randomness

We study multiplayer games in which the participants have access to only limited randomness. This constrains both the algorithms used to compute equilibria (they should use little or no randomness) as well as the mixed strategies that the participants are capable of playing (these should be sparse). We frame algorithmic questions that naturally arise in this setting, and resolve several of them...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computer Science and Information Systems

سال: 2019

ISSN: 1820-0214,2406-1018

DOI: 10.2298/csis180310015l